Increased robustness of Bayesian networks through probability intervals
نویسندگان
چکیده
منابع مشابه
Increased robustness of Bayesian networks through probability intervals
We present an extension of Bayesian networks to probability intervals, aiming at a more realistic and flexible modeling of applications with uncertain and imprecise knowledge. Within the logical framework of causal programs we provide a modeltheoretic foundation for a formal treatment of consistency and of logical consequences. A set of local inference rules is developed, which is proved to be ...
متن کاملDetermination of Maximum Bayesian Entropy Probability Distribution
In this paper, we consider the determination methods of maximum entropy multivariate distributions with given prior under the constraints, that the marginal distributions or the marginals and covariance matrix are prescribed. Next, some numerical solutions are considered for the cases of unavailable closed form of solutions. Finally, these methods are illustrated via some numerical examples.
متن کاملLarge Incomplete Sample Robustness in Bayesian Networks
Under local DeRobertis (LDR) separation measures, the posterior distances between two densities is the same as between the prior densities. Like Kullback Leibler separation they also are additive under factorization. These two properties allow us the prove that the precise specification of the prior will not be critical with respect to the variation distance on the posteriors under the followin...
متن کاملSequential Updating Conditional Probability in Bayesian Networks by Posterior Probability
The Bayesian network is a powerful knowledge representation formalism; it is also capable of improving its precision through experience. Spiegelhalter et al. [1989] proposed a procedure for sequential updating forward conditional probabilities (FCP) in Bayesian networks of diameter 1 with a single parent node. The procedure assumes certainty for each diagnosis which is not practical for many ap...
متن کاملApproximating discrete probability distributions with Bayesian networks
I generalise the arguments of [Chow & Liu 1968] to show that a Bayesian network satisfying some arbitrary constraint that best approximates a probability distribution is one for which mutual information weight is maximised. I give a practical procedure for finding an approximation network. The plan is first to discuss the approximation problem and its link with Bayesian network theory. After id...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1997
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(96)00138-7